Macro Tree Transducers in Treebag
نویسنده
چکیده
Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models implemented as a component in Treebag. Compared to the top-down tree transducer, the macro tree transducer provides a more powerful model of computation. This thesis describes how Treebag is extended with a macro tree transducer component.
منابع مشابه
Branching Tree Grammars in TREEBAG
In this master thesis project a class of tree grammars called “Branching tree grammar” has been implemented into the TREEBAG system. A tree grammar is a device that generates a language of mathematical trees, according to rules specified by the user. These trees can then be transformed into for example pictures, by other components in TREEBAG. The branching tree grammar, which is a class of gra...
متن کاملThe TREEBAG Manual
This document describes the use of Treebag, a system implemented in Java that allows to generate and transform objects using tree grammars and tree transducers. The basic ideas underlying Treebag are briefly summarised in Section 1. In Section 2 the Treebag worksheet—the main window of the system—is described. Section 3 explains the syntax of files needed to define worksheet configurations and ...
متن کاملMulti-Return Macro Tree Transducers
An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.
متن کاملA Pumping Lemma for Output Languages of Macro Tree Transducers
The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functional languages which are based on primitive recursion. In this paper, for output languages of producing and nondeleting macro tree transducers, we introduce and prove a pumping lemma. We apply this pumping lemma to gain two results: (1) there is no producing and nondeleti...
متن کاملMacro Tree Transducers
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. ...
متن کامل